Shared Generation of Shared RSA Keys 1
نویسندگان
چکیده
The paper considers the problem of distributed key generation for shared-control RSA schemes. In particular: how can two parties generate a shared RSA key in such a way that neither party can cheat? The answer to this question would have signi cant applications to, for example, key escrow systems. Cocks has recently proposed protocols to solve this problem in the case when both parties act honestly. However, we show that the Cocks protocols [6] are insecure if a dishonest party actively deviates from the protocol. A new protocol which resists these active attacks is proposed.
منابع مشابه
Experimenting with Shared Generation of RSA Keys
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved in the computation are convinced that N is a product of two large primes, however none of them know the factorization of N . In addition, a public encryption exponent is publicly known and each server holds a share of...
متن کاملGBD Threshold Cryptography with an Application to RSA Key Recovery
We present protocols for threshold cryptography in the GBD public-key cryptosystem. Both threshold decryption and threshold key generation are covered, in the “honest-butcurious” setting. This shows that it is possible to perform GBD computations in a distributed manner during both key generation and decryption, without revealing the private key to any party. GBD threshold decryption is similar...
متن کاملGBD Threshold Cryptography with an Application to RSA Key Recovery
We present protocols for threshold decryption and threshold key generation in the GBD public-key cryptosystem in the “honest-butcurious” setting. These allow GBD computations to be performed in a distributed manner during both key generation and decryption, without revealing the private key to any party. GBD threshold decryption is similar to El-Gamal threshold decryption. GBD threshold key gen...
متن کاملEfficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
We present a new protocol for efficient distributed computation modulo a shared secret. We further present a protocol to distributively generate a random shared prime or safe prime that is much more efficient than previously known methods. This allows to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known.
متن کاملGeneration of Shared RSA
At Crypto'97 Boneh and Franklin proposed a protocol to eeciently generate shared RSA keys. In the case of two parties, the drawback of their scheme is the need of an independent third party. Furthermore, the security is guaranteed only if the three players follow the protocol. In this paper, we propose a protocol that enables two parties to evaluate any algebraic expression, including an RSA mo...
متن کامل